Recognition Algorithms for Binary Signed-Graphic Matroids
نویسندگان
چکیده
In this paper we provide two recognition algorithms for the class of signed-graphic matroids along with necessary and sufficient conditions for a matroid to be signed-graphic. Specifically, we provide a polynomial-time algorithm which determines whether a given binary matroid is signed-graphic and an algorithm which determines whether a general matroid given by an independece oracle is binary signed-graphic.
منابع مشابه
Regular Matroids with Graphic Cocircuits
In this paper we examine the effect of removing cocircuits from regular matroids and we focus on the case in which such a removal always results in a graphic matroid. The first main result, given in section 3, is that a regular matroid with graphic cocircuits is signed-graphic if and only if it does not contain two specific minors. This provides a useful connection between graphic, regular and ...
متن کاملDecomposition of Binary Signed-Graphic Matroids
In this paper we employ Tutte’s theory of bridges to derive a decomposition theorem for binary matroids arising from signed graphs. The proposed decomposition differs from previous decomposition results on matroids that have appeared in the literature in the sense that it is not based on k-sums, but rather on the operation of deletion of a cocircuit. Specifically, it is shown that certain minor...
متن کاملDecompositions of signed-graphic matroids
We give a decomposition theorem for signed graphs whose frame matroids are binary and a decomposition theorem for signed graphs whose frame matroids are quaternary.
متن کاملComputing Girth and Cogirth in Perturbed Graphic Matroids
We give efficient randomized algorithms for computing the girth and the cogirth of binary matroids that are low-rank perturbations of graphic matroids.
متن کاملOn cographic matroids and signed-graphic matroids
We prove that a connected cographic matroid of a graph G is the bias matroid of a signed graph Σ iff G imbeds in the projective plane. In the case that G is nonplanar, we also show that Σ must be the projective-planar dual signed graph of an actual imbedding of G in the projective plane. As a corollary we get that, if G1, . . . , G29 denote the 29 nonseparable forbidden minors for projective-pl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012